Combining request scheduling with web caching

Combining request scheduling with web caching

We extend the classic paging model by allowing reordering of requests under the constraint that a request is delayed by no longer than a predetermined number of time steps. We first give a dynamic programming algorithm to solve the offline case. Then we give tight bounds on competitive ratios for the online case. For caches of size k, we obtain bounds of k + O(1) for deterministic algorithms an...

The Trickle-Down Effect: Web Caching and Server Request Distribution

The Trickle-down Eeect: Web Caching and Server Request Distribution

Web proxies and Content Delivery Networks (CDNs) are widely used to accelerate Web content delivery and to conserve Internet bandwidth. These caching agents are highly e ective for static content, which is an important component of all Web-based services. This paper explores the e ect of ubiquitous Web caching on the request patterns seen by other components of an end-to-end content delivery ar...

On Request Forwarding for the Dynamic Web Caching Hierarchies

To enhance the performance of Web caching, we proposed a dynamic Web caching hierarchy scheme based upon the Caching Neighborhood Protocol (CNP) [1][2] to facilitate establishing flexible cooperation partnerships among the Web origin servers and proxy servers. One of the key issues to the success of using CNP for the Web caching is request forwarding, i.e., to which destination server a client-...

LRU Caching with Moderately Heavy Request Distributions

Majority of practical caching algorithms, in particular those used in the World Wide Web applications, are based on the so-called Least-Recently-Used (LRU) cache replacement heuristic whose desirable attributes include low complexity, quick adaptability and high cache hit (low fault) probability. Recent studies have developed asymptotic characterization of the LRU fault probability for the gene...